cellular automata

Terms from Artificial Intelligence: humans at the heart of algorithms

Page numbers are for draft copy at present; they will be replaced with correct numbers when final book is formatted. Chapter numbers are correct and will not change now.

Cellular automata are simple computational elements laid out in a spatial pattern, most commonly a square grid, where each automata's state updates based only on its own state and that of its neighbours. The most well known example is Comway's Game of Life. Very simple rules can give rise to complex emergent behaviour.

Used in Chap. 16: pages 264, 265, 268